Contour - based tracking with Particle Filters – The Condensation Algorithm

نویسنده

  • Giorgio Panin
چکیده

From Wikipedia: definition of Visual Tracking Visual tracking is the process of locating a moving object (or several ones) in time using a camera. An algorithm analyzes the video frames and outputs the location, optionally in real time. A visual tracking algorithm is based on a motion model which describes how the image of the target changes depending on a vector of motion parameters. When the target is a rigid 3D object, the motion model defines its aspect depending on its 3D position and orientation. The role of the tracking algorithm is to analyse the video frames in order to estimate the motion parameters. These parameters characterize the location of the target. Applications of real-time 3D tracking cover many fields of interest, for which commercial products are increasingly becoming available. Today there are several known approaches for this task, and we consider here some advanced techniques, by organizing them into • Point-based tracking: Tracking of single point features, followed by least-squares object pose estimation. • Contour-based tracking: Detection of the object boundary line (e.g. active contours, or Condensation algorithm) as it deforms with the roto-translation of the object in space • Template-based tracking: Registration of the whole object surface, given as a triangular mesh, together with its texture (i.e. the surface appearance) Lecture Slides from our WS06/07 Course " Advanced 3D Tracking Methodologies " provide also useful material for this Seminar. They are available at Please visit also the following Webpage for further interest (NOTE: the page is still " work in progress ")

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Visual contour tracking based on particle filters

—In the computer vision community, the Condensation algorithm has received considerable attention. Recently, it has been proven that the algorithm is one variant of particle filter (also known as sequential Monte Carlo filter, sequential importance sampling etc.). In sampling stage of Condensation, particles are drawn from the prior probability distribution of the state evolution transition, wi...

متن کامل

Spatio-Temporal Graphical-Model-Based Multiple Facial Feature Tracking

It is challenging to track multiple facial features simultaneously when rich expressions are presented on a face. We propose a twostep solution. In the first step, several independent condensation-style particle filters are utilized to track each facial feature in the temporal domain. Particle filters are very effective for visual tracking problems; however multiple independent trackers ignore ...

متن کامل

Combining Local Search, Neural Networks and Particle Filters to Achieve Fast and Reliable Contour Tracking

LS-N-IPS (Local-Search-N-Interacting-Particle-System) is an extension of the standard N-IPS particle filter (also known as CONDENSATION in the image processing literature). The modified algorithm adds local search to the baseline algorithm: in each time step the predictions are refined in a local search procedure that utilizes the most recent observation. A critical choice in the design of LS-N...

متن کامل

Unscented Auxiliary Particle Filter Implementation of the Cardinalized Probability Hypothesis Density Filters

The probability hypothesis density (PHD) filter suffers from lack of precise estimation of the expected number of targets. The Cardinalized PHD (CPHD) recursion, as a generalization of the PHD recursion, remedies this flaw and simultaneously propagates the intensity function and the posterior cardinality distribution. While there are a few new approaches to enhance the Sequential Monte Carlo (S...

متن کامل

An Efficient Target Tracking Algorithm Based on Particle Filter and Genetic Algorithm

In this paper, we propose an efficient hybrid Particle Filter (PF) algorithm for video tracking by employing a genetic algorithm to solve the sample impoverishment problem. In the presented method, the object to be tracked is selected by a rectangular window inside which a few numbers of particles are scattered. The particles’ weights are calculated based on the similarity between feature vecto...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007